Proof of knowledge - PDFSEARCH.IO - Document Search Engine

Proof of knowledge
Results: 441

#	Item
161	Efficient Set Operations in the Presence of Malicious Adversaries Carmit Hazay∗ Kobbi Nissim† May 4, 2010 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2010-05-04 07:57:36 Commitment scheme Zero-knowledge proof Oblivious transfer Secure two-party computation Proof of knowledge Communication complexity IP Polynomial Homomorphic encryption Cryptography Cryptographic protocols Secure multi-party computation
162	Delegateable Signature Using Witness Indistinguishable and Witness Hiding Proofs Chunming Tang1,∗ Dingyi Pei1,2 Zhuojun Liu3 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2004-12-29 06:02:29 Cryptographic protocols Public-key cryptography Proof of knowledge Zero-knowledge proof Digital signature Parity of a permutation PP NP XTR Cryptography Theoretical computer science Applied mathematics
163	On the Impossibility of Approximate Obfuscation and Applications to Resettable Cryptography Nir Bitansky∗ and Omer Paneth† Tel Aviv University and Boston University April 23, 2015 This is an out of date draft that is Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-23 15:21:41 Public-key cryptography IP One-way function Communications protocol Fuse Cryptography Homomorphic encryption Zero-knowledge proof
164	Analysis of some natural variants of the PKP Algorithm Rodolphe LAMPE and Jacques PATARIN PRISM - University of Versailles In 1989, Adi Shamir [15] proposed a new zero-knowledge identication scheme Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-07-04 14:25:42 Zero-knowledge proof Cryptographic hash functions Cryptography Polish State Railways IP
165	Efficiency Limitations for Σ-Protocols for Group Homomorphisms ? (Full Version) Endre Bangerter1 , Jan Camenisch2 , and Stephan Krenn3 1 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-12-04 11:23:33 Information Model theory Proof of knowledge Zero-knowledge proof Structure Homomorphism IP Communications protocol Golden ratio Cryptographic protocols Data Mathematics
166	Zero-Knowledge Accumulators and Set Operations Esha Ghosh1 , Olga Ohrimenko2 , Dimitrios Papadopoulos3 , Roberto Tamassia1 and Nikos Triandopoulos4,3 1 Dept. of Computer Science, Brown University, Providence RI, USA esha Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-28 18:00:30 Mathematics Quantum complexity theory Accumulator Central processing unit Zero-knowledge proof Proof of knowledge Polynomial Function NP Cryptography Cryptographic protocols Applied mathematics
167	How to Delegate Computations: The Power of No-Signaling Proofs Yael Tauman Kalai ∗ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-05-01 02:12:54 Computational complexity theory Interactive proof system NEXPTIME Probabilistically checkable proof IP Cryptographic protocols Soundness NP Zero-knowledge proof Theoretical computer science Applied mathematics Complexity classes
168	Succinct Non-Interactive Arguments via Linear Interactive Proofs Nir Bitansky∗ Tel Aviv University Alessandro Chiesa MIT Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-09-15 12:03:01 Computational complexity theory IP Proof of knowledge Zero-knowledge proof NP Probabilistically checkable proof Soundness Formal verification Snark Theoretical computer science Applied mathematics Cryptographic protocols
169	An extended abstract of this paper is published in the proceedings of the 13th International Conference on Cryptology in India [21] – IndocryptThis is the full version. On the Non-malleability of the Fiat-Shamir Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-12-16 15:16:50 Zero-knowledge proof Proof of knowledge Interactive proof system IP Soundness NP Random oracle Probabilistically checkable proof Fiat-Shamir heuristic Cryptography Cryptographic protocols Non-interactive zero-knowledge proof
170	— A merged version of this work and the work of [DJKL12] appears in the proceedings of the Theory of Cryptography Conference - TCC 2013 — Why “Fiat-Shamir for Proofs” Lacks a Proof Nir Bitansky∗ Tel Aviv Univer Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-12-19 16:42:35 Search algorithms Computational complexity theory Random oracle Interactive proof system Hash function Zero-knowledge proof Universal hashing Collision resistance Hash list Cryptography Cryptographic hash functions Hashing

UPDATE